waashk/dblp huggingface dataset:
coarse-grained reconfigurable architecture for multiple application domains: a case study. in this paper, we propose a coarse-grained reconfigurable architecture, which supports both integer type application domain and floating-point type application domain. our coarse-grained reconfigurable architecture has an 8x8 array of integer processing elements to execute 64 integer operations or 32 floating-point operations in parallel. in order to show the feasibility of the proposed architecture, we use mpeg4 decoder as an integer type application and physics engine for 3d graphics as a floating-point type application. we first analyze these applications and optimize their implementation on the proposed architecture at the system level. then we implement the proposed architecture on an fpga board, which decodes 12 frames per second of mpeg4 cif images and execute up to 160 million floating-point operations per second for the physics engine at 20mhz clock frequency.
evaluation of group communication quality over wibro for ship building environment. in the process of construction in the shipbuilding industry, the loading process requires intimate communication among workers and is very dangerous work. wireless sets with poor voice quality or trs with call connection delays are currently being used for the communication. an ip-based group communication system is proposed to replace the existing communication systems and measurements and quality evaluation of the new system are necessary. to obtain unified communication in the shipbuilding industry on the basis of a poc (pit over cellular) service, the first service in the ip multimedia system, this article reviews the quality measurements and evaluation of group communication, based on an enterprise poc service to overcome a very deteriorated nlos resulting from the extensive presence of steel in the work environment, and to provide efficient communication services. to verify that this service was theoretically applicable in this environment, analysis was performed and the results revealed a turnaround time of 1 second or less so that workers would experience no delay in communication with the wibro-based enterprise poc service.
a 3d coordinate estimation by using reformed two ir led markers and psd camera. we introduced a low-cost and compact motion capture system which enables to play motion games in play station 2[1]. the single-psd motion capture system that used the intensity light of a marker has a weak measurement at an intensity variation. it is so difficult to make markers having omni-direction equal intensity in single-psd. in this paper, we propose a new method that solves aforementioned problems. it can measure 3d coordination with the relation of the optical characteristics if the intensity of a pair of markers is same at forward direction. we made a system based on this proposed method and experimented for performance capability. as a result, we were able to make the motion capture system to the robust system for bad factors, such as variation intensity of markers, external light. the system is stable to obtain 3d positions and an adaptable motion games. the improved system is expected to be useful in animation, movies and games.
patient information display system in hospital using rfid. rfid technology is applied in many fields. this technology has the following advantage. if an object has a tag, reader can recognize the id of the object without contact. if this technology is used for identification of patient in hospital, it will be very useful. patients have different illness. when doctors operate patients or exanimate patients, if the doctor confuses the disease of patient, a fatal medical circumstance may occur. if rfid technology is used for this case, we can easily protect patients from fatal medical mistakes. in this paper, we introduced the developed rfid system for identification of patient in hospital. this system is displayed on the monitor with the information of name, photo, and illness of patient. rfid system uses general-purpose chip em4095. carrier frequency of em4095 is 125khz. operating process of this system is as follows. reader, which made with em4095, recognizes the patient's id. the recognized id is sent to the host computer. host computer search the same id in db of computer. the information of patient in db is shown on the monitor. the information is shown on pda for accompanied person or nurse. as the result, we explain the developed system and showed the photo of system and showed the table of performance.
zone-based fairness control in multi-channel multi-rate high-speed networks. sctp (stream control transmission protocol) is a general-purpose transport protocol for ip network data communications. due to its attractive features such as multi-streaming and multi-homing, sctp has received much attention from the various network communities. this paper introduces the main features of sctp, and presents a zone-based fairness control scheme that includes sctp multi-streaming to solve performance problems and evaluates its performance. the performance of the proposed scheme is evaluated using an opnet simulator. proposed zone-based fairness control scheme overcomes existing problems in the traditional sctp when a multi-streaming feature is used.
improved authentication algorithm for umts. authentication process of user in mobile networks is an important issue. previous standard of telecommunication global system for mobile communication (gsm) has many security weaknesses. under third generation partnership project(3gpp), new standard universal mobile telecommunication system is developed. which removes the security weaknesses of previous standards. however one security loop hole has been revealed in umts. it is the sending of international mobile subscriber identity (imsi) in plain text over the air interface. in this paper we introduce a security algorithm named as airam, whose name is derived from developers of this algorithm. it resolves the problem of sending imsi in plain text over the air interface by implementing asymmetric/symmetric cryptography techniques. we have presented simulation results of airam algorithm that show how effciently airam algorithm performs the user authentication process and its effectiveness against replay and imposition attacks.
a study on the digital watermarking technique for jpeg 2000. recently, according to the number of internet in widely use and the development of the related application, the distribution and use of multimedia contents, such as digital images, are very easy. since these can modify as easy as use, multimedia contents need newly compressed jpeg 2000 and digital watermarking technique because of its enormous amount of information. to protect the digital image in real-time, this paper proposes two methods that dual watermarking method (dwm) based jpeg 2000 and performing jpeg 2000 and watermarking synchronously. dwm consists of the robust and fragile watermarking. also, in dwm, watermarks are carefully embedded avoiding the areas of region of interest (roi) and the edge of the digital image to protect the integrity of it. in performing jpeg 2000 and watermarking, it takes considerably less time to do jpeg 2000 and watermarking than when they are done separately. based on the experimental results, it takes 0.72 second for jpeg 2000 and watermarking, and 1.11 second when they are done separately.
actuation architecture for emotional robotic applications. some robotic applications have been given emotional expression in an attempt to improve human-robot interaction. in this paper, we propose an actuation architecture of emotional robotic applications for faithful expression based on emotion information. it enables optimization of an interaction between a person and a robot based on an emotion, by expression of a natural emotion action suitable for change in autonomous emotion.
robust timing jitter control method for network synchronization. in this paper, a robust timing jitter control method is proposed and analyzed for network synchronization. in order to reduce timing jitter which exists in delays between a master and slave, following delay is estimated by using previous one. then, these estimated ones are not according to exact ones which do not include jitter. but timing jitter can be certainly reduced although remaining some jitters. the proposed method in this paper can be applied to the network synchronization procedure.
the integration of simulation modeling system for student experiment and modeling ability evaluation. this research aims at developing and evaluating the computer simulation software of pendulum, and exploring junior high students' scientific modeling ability. firstly, the researcher analyzed pendulum modeling software development. secondly, after considering the validity of the software, and the assessments of the whole system by the experts in the field, this researcher revised the software to make it more suitable for the purposes of junior high students' pendulum modeling with computer simulation. finally, purposes of this research are to contend the suggestions of application of the software for junior high science teacher, to synthetic development relevant software of pendulum modeling in this research, and to obtain the following conclusions: 1. there are six kinds of variables of simulation pendulum: mass, length, angle, force, air-force, and width of string. based on the modeling software systematic, the researcher needed to develop relevant software tools to help students' modeling, such as time-recorder, grid chart and the film of galileo's history of science. 2. the fuzzy synthetic evaluation was implemented for assessing modeling ability. five aspects, with totally 19 sub items together, are contained in the evaluation system, which can be regarded as the evaluation for student's modeling ability. 3. via the evaluation in discipline content, media interface and the user attitude, etc., this simulation software is suitable for the stage of junior high student pendulum modeling under the movement law, f = m a.
the structure of the sdp using enablers in the ims. nowadays in communication and network businesses, architectures and systems are independently constructed with existing service or new service deployment without considering common functions and services between them. consequently, the study of standardized service delivery platform (sdp) structure and its related interfaces is needed to provide the methodology of existing or new services in an efficient way. in this paper, we suggest the structure of common service enablers for the sdp and show the way of interaction between them. finally, we will describe an implementation of the components of the sdp using them.
nmf features for speech emotion recognition. there are numerous algorithms to detect emotion from speech signals. among the algorithms, we selected spectral analysis and fused non-negative matrix factorization (nmf) for obvios emotion classification. the algorithm has been tested in several different ways by varying nmf and the speech database. the experimental results show performance of 90% and classification success of 77% for speaker dependent and independent cases, respectively.
a mac protocol considering traffic load information for a cluster based wireless sensor network. power conservation is crucial in designing wireless sensor networks (wsns) with long network lifetime. an energy and delay efficient tdma scheduling algorithm for a cluster based wireless sensor network is proposed. the proposed energy efficient dynamic scheduling (eeds) algorithm in this paper uses the information about node traffic load, the number of member nodes and its qos (quality of service) requirement. our eeds algorithm could reduce energy consumption and transmission delay. through mathematical analysis we evaluate the performance of our algorithm and compare to the related works.
incentive mechanism for service differentiation in p2p networks. p2p (peer-to-peer) networks are self-organizing networks and rely on voluntary contribution from individual peers. peers can easily access information without contributing any information or service to p2p networks. this leads to the well known "free-riding" problem. in order to encourage the cooperation of peers, there needs to be an incentive mechanism that rewards cooperation and punishes free riding. in this paper, we propose an incentive mechanism, called p2pim (p2p incentive mechanism for service differentiation), which computes the contribution by monitoring the peer's behavior and provides the differentiated service according to the peer's contribution. our simulation results show the efficiency and stability of proposed incentive mechanism.
a study of metadata design for e-learning marketplace based on iptv. e-learning marketplace based on iptv is defined as the marketplace for e-learning service between contents supplier and demander through iptv environment. this e-learning marketplace is increasing the interest of e-learning service provider with its interactive media characteristics. to iptv, it can contribute to enhance its effectiveness by developing various contents and service model in the initial phase of broadcasting-communication convergence. this study designed metadata using e-learning marketplace based on iptv. especially the metadata designing include recommendation-tag for supply supplementary learning content. it can support self-directed learning. through basic metadata with weight value, it is designed to support supplementary learning content from customers to wants on the marketplace. recommendation-system can be built by many methods for recommending the learning content including explicit properties using collaborative filtering method that can solve limitations in existing learning recommendation.
parallel-machine scheduling of simple linear deteriorating jobs. we consider parallel-machine scheduling problems in which the processing time of a job is a simple linear increasing function of its starting time. the objectives are to minimize the makespan, total machine load, and total completion time. we show that all the problems are strongly np-hard with an arbitrary number of machines and np-hard in the ordinary sense with a fixed number of machines. for the former two problems, we prove that there exists no polynomial time approximation algorithm with a constant worst-case bound when the number of machines is arbitrary unless p=np. when the number of machines is fixed, we propose two similar fully polynomial-time approximation schemes for the former two problems.
on the descriptional complexity of watson-crick automata. watson-crick automata are finite state automata working on double-stranded tapes, introduced to investigate the potential of dna molecules for computing. in this paper, we continue the investigation of descriptional complexity of watson-crick automata initiated by paun et al. [a. paun, m. paun, state and transition complexity of watson-crick finite automata, in: g. ciobanu, g. paun (eds.), fundamentals of computation theory, fct'99, in: lncs, vol. 1684, 1999, pp. 409-420]. in particular, we show that any finite language, as well as any unary regular language, can be recognized by a watson-crick automaton with only two, and respectively three, states. also, we formally define the notion of determinism for these systems. contrary to the case of non-deterministic watson-crick automata, we show that, for deterministic ones, the complementarity relation plays a major role in the acceptance power of these systems.
sequential snp systems based on min/max spike number. we consider the properties of spiking neural p (snp) systems that work in a sequential manner. these snp systems are a class of computing devices recently introduced as a bridge between spiking neural nets and membrane computing. the general sequentiality of these systems was considered previously; now we focus on the sequentiality induced by the spike number: at each step, the neuron with the maximum (or minimum) number of spikes among the neurons that are active (can spike) will fire. this strategy corresponds to a global view of the whole network that makes the system sequential. we study the properties of this type of a restriction (i.e. considering the case of sequentiality induced by the function maximum defined on numbers of spikes as well as the case of the sequentiality induced by the function minimum similarly defined on numbers of spikes). several universality results are obtained for the cases of maximum and minimum induced sequentiality.
on determinism in modal transition systems. modal transition system (mts) is a formalism which extends the classical notion of labelled transition systems by introducing transitions of two types: must transitions that have to be present in any implementation of the mts and may transitions that are allowed but not required. the mts framework has proved to be useful as a specification formalism of component-based systems as it supports compositional verification and stepwise refinement. nevertheless, there are some limitations of the theory, namely that the naturally defined notions of modal refinement and modal composition are incomplete with respect to the semantic view based on the sets of the implementations of a given mts specification. recent work indicates that some of these limitations might be overcome by considering deterministic systems, which seem to be more manageable but still interesting for several application areas. in the present article, we provide a comprehensive account of the mts framework in the deterministic setting. we study a number of problems previously considered on mts and point out to what extend we can expect better results under the restriction of determinism.
dejean's conjecture holds for n>=30. we extend carpi's results by showing that dejean's conjecture holds for n>=30.
set multi-covering via inclusion-exclusion. set multi-covering is a generalization of the set covering problem where each element may need to be covered more than once and thus some subset in the given family of subsets may be picked several times for minimizing the number of sets to satisfy the coverage requirement. in this paper, we propose a family of exact algorithms for the set multi-covering problem based on the inclusion-exclusion principle. the presented esmc (exact set multi-covering) algorithm takes o^*((2t)^n) time and o^*((t+1)^n) space where t is the maximum value in the coverage requirement set (the o^*(f(n)) notation omits a polylog(f(n)) factor). we also propose the other three exact algorithms through different tradeoffs of the time and space complexities. to the best of our knowledge, this present paper is the first one to give exact algorithms for the set multi-covering problem with nontrivial time and space complexities. this paper can also be regarded as a generalization of the exact algorithm for the set covering problem given in [a. bjorklund, t. husfeldt, m. koivisto, set partitioning via inclusion-exclusion, siam journal on computing, in: focs 2006 (in press, special issue)].
defining syntax-directed translations by tree bimorphisms. we introduce a class of tree bimorphisms that define exactly the translations performed by syntax-directed translation schemata. we also show that these ''quasi-alphabetic'' tree bimorphisms preserve recognizability, and that their class is closed under composition and inverses.
separation numbers of trees. let g be a graph on n vertices. given a bijection f:v(g)->{1,2,...,n}, let |f|=min{|f(u)-f(v)|:uv@?e(g)}. the separation numbers(g) (also known as antibandwidth [t. calamoneri, a. massini, l. torok, i. vrt'o, antibandwidth of complete k-ary trees, electronic notes in discrete mathematics 24 (2006), 259-266; a. raspaud, h. schroder, o. sykora, l. torok, i. vrt'o, antibandwidth and cyclic antibandwidth of meshes and hypercubes, discrete mathematics 309 (2009) 3541-3552] of g is then max{|f|} over all such bijections f of g. we study the case when g is a forest, obtaining the following results. 1.let f be a forest in which each component is a star. then s(f)=n-@m2, where @m is the minimum value of @?x|-|y@? over all bipartitions (x,y) of f. 2.let d be the maximum degree of a tree t on n vertices. then (a)s(t)>=n2-c"1nd, and (b)s(t)>=n2-c"2d^2log"dn, where c"1 and c"2 are absolute constants. we give constructions showing that the bound (a) is asymptotically tight when d is in the range n^1^3=4 is an absolute constant. we also show that for h>=3 and odd d>=3, we have s(t"h^d)=n2-@q(d^2+dh), where t"h^d is the symmetric d-ary tree of height h, improving the estimates obtained in the first of the above-mentioned references.
pattern avoidance by palindromes. we show that every avoidable pattern can be avoided by an infinite sequence of palindromes over a fixed finite alphabet.
hard constraint satisfaction problems have hard gaps at location 1. an instance of the maximum constraint satisfaction problem (max csp) is a finite collection of constraints on a set of variables, and the goal is to assign values to the variables that maximises the number of satisfied constraints. max csp captures many well-known problems (such as maxk-sat and max cut) and is consequently np-hard. thus, it is natural to study how restrictions on the allowed constraint types (or constraint language) affect the complexity and approximability of max csp. the pcp theorem is equivalent to the existence of a constraint language for which max csp has a hard gap at location 1; i.e. it is np-hard to distinguish between satisfiable instances and instances where at most some constant fraction of the constraints are satisfiable. all constraint languages, for which the csp problem (i.e., the problem of deciding whether all constraints can be satisfied) is currently known to be np-hard, have a certain algebraic property. we prove that any constraint language with this algebraic property makes max csp have a hard gap at location 1 which, in particular, implies that such problems cannot have a ptas unless p=np. we then apply this result to max csp restricted to a single constraint type; this class of problems contains, for instance, max cut and max dicut. assuming p
a sturmian sequence related to the uniqueness conjecture for markoff numbers. sturmian sequences appear in the work of markoff on approximations of real numbers and minima of quadratic functions. in particular, christoffel words, or equivalently pairs of relatively prime nonnegative integers, parametrize the markoff numbers. it was asked by frobenius if this parametrization is injective. we answer this conjecture for a particular subclass of these numbers, and show that a special sturmian sequence of irrational slope determines the order of the markoff numbers in this subclass.
on the synchronized derivation depth of context-free grammars. we consider depth of derivations as a complexity measure for synchronized and ordinary context-free grammars. this measure differs from the earlier considered synchronization depth in that it counts the depth of the entire derivation tree. we consider (non-)existence of trade-offs when using synchronized grammars as opposed to non-synchronized grammars and establish lower bounds for certain classes of linear context-free languages.