ppxscal/embedding_network huggingface dataset:
Effect of Delivery Latency, Feedback Frequency and Network Load on Adaptive Multimedia Streaming
Authors: Gabriel-Miro Muntean
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

As video on demand systems gain popularity, it seems likely that the desire to serve a high number of customers from limited network resources could lead to a degradation of the endusers' perceived quality. Quality-Oriented Adaptation Scheme (QOAS) balances the need for high quality with increased network utilization when streaming multimedia. QOAS requires client-side monitoring of some transmission-related parameters, grading of the end-user's quality and feedback that informs the server about the received quality. In response to this feedback, the server adjusts the streaming process in order to maximize the end-user perceived quality in the current conditions. This paper studies the effect of delivery latency and feedback frequency on quality-oriented adaptive multimedia streaming. It also shows how high end-user perceived quality is maintained in the presence of different types of background traffic while recording a significant increase in link utilization and a very low loss rate.
Efficient computation of reverse skyline queries
Authors: Evangelos Dellis, Bernhard Seeger
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

In this paper, for the first time, we introduce the concept of Reverse Skyline Queries. At first, we consider for a multidimensional data set P the problem of dynamic skyline queries according to a query point q. This kind of dynamic skyline corresponds to the skyline of a transformed data space where point q becomes the origin and all points of P are represented by their distance vector to q. The reverse skyline query returns the objects whose dynamic skyline contains the query object q. In order to compute the reverse skyline of an arbitrary query point, we first propose a Branch and Bound algorithm (called BBRS), which is an improved customization of the original BBS algorithm. Furthermore, we identify a super set of the reverse skyline that is used to bound the search space while computing the reverse skyline. To further reduce the computational cost of determining if a point belongs to the reverse skyline, we propose an enhanced algorithm (called RSSA) that is based on accurate pre-computed approximations of the skylines. These approximations are used to identify whether a point belongs to the reverse skyline or not. Through extensive experiments with both real-world and synthetic datasets, we show that our algorithms can efficiently support reverse skyline queries. Our enhanced approach improves reversed skyline processing by up to an order of magnitude compared to the algorithm without the usage of pre-computed approximations.
Study on Statistics Iterative Thresholding Segmentation Based on Aviation Image
Authors: Guang Yang, Kexiong Chen, Maiyu Zhou, Zhonglin Xu, Yongtian Chen
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Image segment is one of the most fundamental and difficult problems in image analysis and computer vision. The image thresholding problem is treated as an important issue in image processing, and it can not only reduce the image data, but also lay a good foundation for succedent target recognition and image understanding. Character of global thresholding segmentation and local thresholding was analyzed in image segmentation. A new thresholding statistic iterative arithmetic is presented to overcome the direct worth method in thresholding, aiming at some lighting asymmetry and the abrupt a blemish for, or bigger arithmetic figure in ratio in a variety in gray of background image. Statistics iterative thresholding segmentation, based on image gray histogram and Gauss statistics distributing, obtain the theory expression of statistics iterative method and the best worth thresholding method and steps. Aviation image was thresholding segmentation using statistic iterative arithmetic, histogram technique and adaptive method respectively. Compared three thresholding results, it shows that statistic iterative method greatly improved the anti-noise capability of image segmentation and had the good result to the image of the worth and not easy to segment in full value thresholding method.
Computer-Aided Design of Plant Electrical Systems
Authors: F. T. Dawson
Venue: IEEE Computer Graphics and Applications (1982)

The electrical system is the crucial final stage of plant design. CAD relieves time pressure and yields significant savings of money.
Fuzzy Color Histogram Based Kernel Tracking under Varying Illumination
Authors: Yongzhong Wang, Quan Pan, Chunhui Zhao, Yongmei Cheng
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

A conventional color histogram is sensitive to noisy interference such as lighting changes and quantization errors. Therefore the tracker based on conventional color histogram is unreliable or even failed under varying illumination. In this paper we propose a dynamically corrected fuzzy color histogram based kernel tracking algorithm, which utilizes the local background information around tracking target to dynamically correct its fuzzy color histogram model and eliminates the sensitive of conventional color histogram to illumination change and noise. The algorithm is tested on several image sequences and shown that it can smooth the similarity surface and achieve robust and reliable frame-rate tracking results under varying illumination conditions.
Trends in Memory Element and Subsystem Design in the 1970's.
Authors: R. J. Petschauer
Venue: Computer (1970)

A thorough treatment of the trends in memory element and subsystem designs in the 1970's would require a very exhaustive presentation and be considerably beyond the scope of this article. It is hoped, however, that some of the information contained herein will be helpful to the reader.
Coupling-aware Dummy Metal Insertion for Lithography
Authors: Liang Deng, M. D. F. Wong
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

As integrated circuits manufacturing technology is advancing into 65nm and 45nm nodes, extensive resolution enhancement techniques (RETs) are needed to correctly manufacture a chip design. The widely used RET called off-axis illumination (OAI) introduces forbidden pitches which lead to very complex design rules. It has been observed that imposing uniformity on layout designs can substantially improve printability under OAI. For metal layers, uniformity can be achieved simply by inserting dummy metal wire segments at all free spaces. Simulation results indeed show significant improvement in printability with such a dummy metal insertion approach. To minimize mask cost, it is advantageous to use dummy metal segments that are of the same size as regular metal wires due to their simple geometry. But these dummy wires are printable and hence increase coupling capacitances and potentially affect yield. The alternative is to use a set of parallel sub-resolution thin wires (which is not printed) to replace a printable dummy wire segment. These invisible dummy metal segments do not increase coupling capacitances but bring a higher lithography cost, which includes mask cost and RET/process expense. This paper presents a strategy for dummy metal insertion that can optimally trade off lithography cost and coupling capacitance. In particular, we present an optimal algorithm that can minimize lithography cost subject to any given coupling capacitance bound. Moreover, this dummy metal insertion achieves a highly uniform density because of the locality of coupling capacitance, which automatically ameliorates chemical mechanical polish (CMP) problem.
A Novel Approach of Available Bandwidth Estimation for Heterogeneous Networks
Authors: Yuhua Liu, Hao Huang, Kaihua Xu
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Reliable transport protocols such as the Transmission Control Protocol (TCP) are tuned to perform well in traditional wired networks where packet losses occur mostly because of congestion. However, networks with wireless and lossy links also suffer from significant packet losses due to bit errors and hand-offs. TCP Westwood (TCPW) is a recently proposed sender-side modification of TCP congestion control. The main point is to investigate those proposed bandwidth estimate algorithms in TCPW and then propose an enhanced one. We use simulation to validate the performance of the new algorithm.
Debugging Ada Tasking Programs
Authors: D. Heimbold
Venue: IEEE Software (1985)

Debuggers for parallel programs have to be more than passive information gatherers-they should automatically detect errors. Powerful task debuggers for Ada can be constructed by extending existing tools that detect deadlock.
A Fusion Algorithm of Multiple Classifiers for Recognition of Ships Radiated_Noises Based on Many-Person Decision-Makings Theory
Authors: Chunyu Kang, Xinhua Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Recognition of the radiated noises of ships is a very complicated and difficult job. In order to improve the classification performance and dependability of the single classifier, a kind of multi-classifiers decision- making model and detailed algorithm based on many- person decision-makings theory was proposed. By adopting the eight categorized results of the BP neural network and the support vector machines which used the Welch spectrum, the linear predictive coding spectrum, the Burg spectrum and the perceptual linear predictive feature, the group decision-makings were done to recognize three different kinds of radiated noises of ships which were collected in many different operating conditions. Results show that the proposed fusion model and algorithm are feasible and the statistical right recognition probability arrives at 96.44% and its classification performance is superior to the performance of the single classifier. The method can be applied to the underwater acoustic target recognition system.
Specifying and verifying software
Authors: K. Rustan M. Leino
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Software verification presents many challenges. One of these isproviding programmers with automated tool support for verification, another is providing specification support that captures common programming idioms. In this talk, I will discuss these two challenges, drawing from experience with building program verifiersfor Spec# and C. I will also give a demo of the Spec# programming system, which includes the automatic static program verifier Boogie.
Risk Evaluation of Communication Network of Electric Power Based on Improved FAHP
Authors: Hui-sheng Gao, Jing-xue Ran, Yi-qun Sun
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

According to the structure and present development of the electric power communications network, one of its risk evaluation methods based on improved FAHP is proposed. The significance and situation of risk evaluation of the electric power communications network are briefly presented. One new method of fuzzy taxis, called restriction coefficient, is proposed, while explaining its advantages and proposing a method confirming index power weight using triangular fuzzy number and limited digit coefficient. One risk evaluation method of the electric power communications network is advanced while showing its idiographic assessment process and it is validated through some electric power communications network in some place and gets the collectivity risk rank and index taxis. The result shows that the calculation of this evaluation method is simple, and according with fact while having better stability of taxis.
A Computing Machine Based on Tree Structures
Authors: K. J. Berkling
Venue: IEEE Transactions on Computers (1971)

The expenditure of resources to provide via software more structure and more function in conventional machines has become excessive. The answer to this problem may consist in providing more structure and more function in hardware. With respect to structure, we describe 1) the binary tree as basic data and control structure, 2) the implementation of a binary tree by a conventional memory, and 3) the associated hardware. The most important enhancement with respect to function, the newly introduced unit of action, deals with the handling of variables and substitution.
High breakdown voltage 4H-SiC MESFETs with floating metal strips
Authors: Jinping Zhang, Yi Ye, Chunhua Zhou, Xiaorong Luo, Bo Zhang, Zhaoji Li
Venue: Microelectronic Engineering (2008)

A high breakdown voltage 4H-SiC MESFET with floating metal strips (FMS) was proposed. The maximum electrical field of the MESFET gate is clamped after surface depletion layer punch through to FMS. The optimized results showed that the breakdown voltage of the 4H-SiC MESFET with two strips and one strip are 180% and 95% larger than that of the conventional one without FMS and meanwhile maintain almost same saturation drain current. The maximum theoretical output power density of the 4H-SiC MESFET with two strips and one strip are 14.5W and 10.0W compared to 4.8W of the conventional structure. The cut-off frequency (f"T) of 14.7GHz and 15.6GHz and the maximum oscillation frequency (f"m"a"x) of 44.8GHz and 48.7GHz for the 4H-SiC MESFET with two strips and one strip are obtained respectively, which is just a little bit lower than that of the conventional structure.
Comparison between statistical and multiresolution wavelets analysis methods for speech classifications
Authors: Yousef Al-Assaf
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2003)

This paper considers the use of MultiResolution Wavelets Analysis (MRWA) to classify speech for multifunctional control applications. While the classification problem is the focus of this paper, the ultimate goal is to improve speech analysis and their application performances. The proposed method performance was compared to that of temporal-time domain features with ANN classification. Results have shown that MRWA resulted in higher recognition rate and consistent output demonstrating higher reliability.
Semantics based customization of UBL document schemas
Authors: Yalin Yarimagan, Asuman Dogac
Venue: Distributed and Parallel Databases (2007)

Universal Business Language (UBL) is an OASIS initiative to develop common business document schemas to provide document interoperability in the eBusiness domain. Since the data requirements change according to a context, UBL schemas need to be customized and UBL defines a guideline to be followed for customization of schemas. XSD derivation based customization as proposed by UBL provides syntactic interoperability, that is, an XML parser that can interpret standard UBL documents can also interpret customized UBL documents. We argue that for UBL to become mainstream, syntactic interoperability alone is not enough. It needs to be supported by semantic interoperability, that is, it must be possible for users and even automated processes to discover and reuse customizations provided by other users. In this paper, we describe how to improve the UBL customization mechanism by providing semantic representations for context domains and describe how these semantics can be utilized by automated processes for component discovery and schema customization. For this purpose, we derive ontologies from taxonomies like the North American Industry Classification System (NAICS), the Universal Standard Products and Services Classification (UNSPSC) and relate corresponding concepts from different ontologies through ontology alignment. Then, we process these aligned ontologies using a reasoner to compute inferred ontologies representing context domains. We show that when custom UBL components are annotated using classes from these ontologies, automated discovery and customization becomes possible.
Visually Improved Understanding of Three-Dimensionally Propagating Electromagnetic Fields in Wireless Networks
Authors: J. E. Bendz, H. G. Fernandes, M. K. Zuffo
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

Visualizations are highly valuable in improving the understanding, as well as the analysis of a variety of physical phenomena. Two such applications can be as a pedagogical tool for enhanced perception of complex topics, or as an everyday aid that helps engineers interpret the outcome of simulations. In this paper we try to meet both these objectives and propose a novel approach to three-dimensionally visualize time-varying electromagnetic fields and show how this can be applied to improve the understanding of propagating radio waves used in wireless communication networks. To obtain this, we use a numerical version of Maxwell's equations to create snapshots of a propagating electromagnetic field. In this manner we are able to not only, intuitively get a better general understanding of radio waves, but also disclose important phenomena such as diffraction, reflection, attenuation and multipath behavior.
The ProgrammableWeb: Agile, Social, and Grassroot Computing
Authors: E. Michael Maximilien, Ajith Ranabahu
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Web services, the Semantic Web, and Web 2.0 are three somewhat separate movements trying to make the Web a programmable substrate. While each has achieved some level of success on their own right, it is becoming apparent that the grassroot approach of the Web 2.0 is gaining greater success than the other two. In this paper we analyze each movement, briefly describing its main traits, and outlining its primary assumptions. We then frame the common problem of achieving a programmable Web within the context of distributed computing and software engineering and then attempt to show why Web 2.0 is closest to give a pragmatic solution to the problem and will therefore likely continue to have the most success while the other two only have cursory contributions.
Research on CNCbCAD&CAPP Technology in Intelligent Numerical Control
Authors: Hui Xu, Tian-Sheng Li, Sheng Lu, Tan Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

This paper is based on a new philosophy of CNC (Computer Numerical Control), which is named as INC (Integrated Numerical Control or Intelligent Numerical Control). CNCbCAD&CAPP (CNC technology based on CAD&CAPP) is one of the most important key technology used in INC. First this paper has a brief introduction of INC and describes the important characteristics of INC. Second it introduces and analyses the one of INC's three key technologies: CNC technology based on CAD&CAPP, which has mended general CNC system to fit CAD&CAPP. It mainly includes building a new INC standard with a STEP (Standard for the Exchange of Product Model Data) extension, expression based features, embedded technology, real-time Linux technology and so on. It focuses on discussing the theory and the principle of them.
Gaze Direction Estimation Based on Natural Head Movements
Authors: Jing Xie, Xueyin Lin
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In this paper, we present a new approach for estimating head pose and gaze direction under a monocular vision. The human visual line-of-sight consists of two components: the pose of head and the orientation of eyes within their sockets. First we compute the head pose of a user, and then calculate the gaze direction from the relative positions of the iris and the inner eye corner. The experimental results show that under natural head movements (yaw and pitch angles of head in real image sequences are up to 30^o and 20^o , respectively), our method achieves an average deviation to 2^o and 4^o in azimuth and elevation angles respectively.
An Introduction to the Construction and Verification of Alphard Programs
Authors: W. A. Wulf
Venue: IEEE Transactions on Software Engineering (1976)

The programming language Alphard is designed to provide support for both the methodologies of "well-structured" programming and the techniques of formal program verification. Language constructs allow a programmer to isolate an abstraction, specifying its behavior publicly while localizing knowledge about its implementation. The verification of such an abstraction consists of showing that its implementation behaves in accordance with its public specifications; the abstraction can then be used with confidence in constructing other programs, and the verification of that use employs only the public specifications.
Hierarchical Layout Verification
Authors: Todd Wagner
Venue: IEEE Design Test (1985)

This article presents a hierarchical cell structure that has been Used successfully to improve the performance of Intel'sconnectivity verifier and design rule checker. A unique algorithm for performing design rule checks efficiently in a hierarchicalenvironment is discussed in detail. To undersize and oversize in a hierarchical environment without disrupting the cell structure,the definition of sizing must be changed so that geometries inside a cell and touching the cell boundaries do not pull awayand geometries outside the cell do not extend inside. There are also a few Pathologies?caused mostly by looking at only asmall portion of the layout, outside of the context where it is used. Nevertheless, careful use of hierarchical design candeliver order-of-magnitude improvements in layout checking runtime.
Deadlock Detection and Avoidance for Shared Logical Resources
Authors: D. J. Rypka
Venue: IEEE Transactions on Software Engineering (1979)

Logical resources are defined as shared passive entities that can be concurrently accessed by multiple processes. Concurrency restrictions depend upon the mode or manner in which a process may manipulate a resource. Models incorporating these single unit resources can be used to analyze information locking for consistency and integrity purposes. Mode compatibility is defined and used to derive dead-lock detection and avoidance methods. These methods generalize well-known deadlock results for single unit resources by permitting greater concurrency while still guaranteeing data consistency. This model is applicable to the standard shared (read-only) and exclusive (read-write) access modes as well as a useful subset of those proposed in the CODASYL DBMS report.
A Dyeing Color Matching Method Combining RBF Neural Networks with Genetic Algorithms
Authors: Hai-tao Li, Ai-song Shi, Bing-sen Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

This paper makes use of the non-linear relation between dye concentration and textile reflectivity, and the non-linear relation between textile reflectivity and the Lab value of textile to achieve a conclusion that there is a non-linear relation between dye concentration and the Lab value of textile. In addition, this paper uses the RBF (radial basis function) neural network to approximate the relation. The dye concentration is the neural network's input value and the Lab value of textile is the output. To find the optimal formula of color matching, the Genetic Algorithm is also involved in the model. Specifically, let the dye concentration be the individual. The individual serves as the RBF's input, and we use the color difference \Delta E between the RBF's output and object color be the fitness function. Compared to the color matching concerning Kubelka-Munk theory, the model possesses some advantages as following: low cost, no assumptions in it, high precision, fast-achieved formula, etc. Experiments prove that this model can quickly provide the users with a satisfying formula.