CN102957948A - Processing method of displayed content timeline data used for television program assessment - Google Patents
Processing method of displayed content timeline data used for television program assessment Download PDFInfo
- Publication number
- CN102957948A CN102957948A CN2011102535036A CN201110253503A CN102957948A CN 102957948 A CN102957948 A CN 102957948A CN 2011102535036 A CN2011102535036 A CN 2011102535036A CN 201110253503 A CN201110253503 A CN 201110253503A CN 102957948 A CN102957948 A CN 102957948A
- Authority
- CN
- China
- Prior art keywords
- record
- new
- carry out
- out step
- last item
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Television Signal Processing For Recording (AREA)
Abstract
The invention relates to a processing method of televised content timeline data used for television program assessment. The processing method comprises the following steps that: (1) a data processing server loads program journal files in a program journal file storage server and generates new program list data, and the step (2) is carried out after loading; (2) the data processing server loads advertisement journal files in an advertisement journal file storage server and generates new advertisement list data, and the step (3) is carried out after loading; and (3) a new timeline object set is established, program data in a new program list and advertisement data in a new advertisement list are combined in the timeline object set according to a time order and a time priority, and then the timeline object set is stored in a database server. Compared with the prior art, for the processing method, two independent timeline journals can be fast and accurately combined into a complete and accurate timeline capable of restoring a playing condition, and the problem of timeline data processing in a field is successfully solved.
Description
Technical field
The present invention relates to a kind of processing method of data, especially relate to a kind of processing method of the broadcast content timeline data for TV programme assessment.
Background technology
Set up the TV programme evaluation system of science, the actual broadcast content of TV station and situation must be filed arrangement, become the available data format of investigation and analysis, this is the element task that the viewership of TV programme is analyzed, assessed.Along with the wave of digitalization in the whole media industry, it is more and more accurate that flow process control is broadcast to the volume of program and advertisement by TV station, the behavior of televiewer's convert media and channel is more and more frequent, and this basic data of media analysis is collected and arrangement, has proposed in the more accurate demand of timeline.
The archiving method that present domestic industry is taked is the method that programme content separates with ad content, and program and the commercial content of intercutting of normal record and broadcast are separated, and record is archived in the different database files respectively.Describe the database file that program and advertisement are broadcasted, adopt approximate method to come two kinds of different broadcast contents to be carried out the time, the filing on channel and the content.The critical field of describing its record is mainly, and broadcasts channel, broadcasts the date, and broadcast items/advertised name broadcasts zero-time, the close of transmission time etc.Such archiving method does not reduce the intact condition of television broadcasting, and the value that the data that obtain are further analyzed is restricted, and can only analyze from respective angles the broadcast of program or advertisement itself.
In order to address the above problem, mainly to process the broadcast daily record data with excel macro in the industry, and independently play daily record by two of VBA program merging.Because the limitation of Excel self, the speed of service is relatively slow when processing large-scale data, and can't concentrate the timeline data of preserving after merging for analysis and research.The computer of a mainstream configuration, need to spend 5 minutes time when in Excel, merging 15 days broadcast daily record of 1 channel (about 12000 records), and to spend several days time to carry out the previous works such as program arrangement, finish 15 days daily record of 62 channels and merge and to spend 3 months time nearly, can't analyze timely the broadcast situation.
Summary of the invention
Purpose of the present invention be exactly provide in order to overcome the defective that above-mentioned prior art exists a kind of with two independently the timeline daily record merge into one complete, accurately reduce the timeline of broadcast situation, successfully solved the processing method of the broadcast content timeline data that are used for the TV programme assessment of this field timeline data processing problem.
Purpose of the present invention can be achieved through the following technical solutions: a kind of processing method of the broadcast content timeline data for TV programme assessment, it is characterized in that, this processing method may further comprise the steps: 1) data processing server loads the program log file in the program log document storage server, generate new program data, carry out step 2 after loading is finished); 2) the ad log file in the data processing server carrying advertisement journal file storage server generates new advertising listing data, carry out step 3 after loading is finished); 3) set up new timeline object set, ad data in program data in new the rendition list and the new advertising listing is merged in the timeline object set according to time order and function and priority, and then line object is gathered database server the holding time.
Described step 1) specifically may further comprise the steps: the program recording that 11) reads in the program log file is capable, and determines whether end-of-file, then finishes if the judgment is Yes, otherwise carry out step 12); 12) regenerate program A with new form with program recording is capable, whether the title of then judging program A is " program begins " or " program end ", if the judgment is Yes, then carry out step 13), otherwise whether the time started of judging program A equals the concluding time of a program B who regenerates, if the judgment is Yes, then program A is added new the rendition list, otherwise carry out step 14); 13) priority with program A is made as very, if the name of program A is called " program begins " then program A is added new the rendition list, then carry out step 11), if the name of program A is called " program end ", then program A is added new the rendition list, finish; Whether the time started of 14) judging program A if the judgment is Yes, then regenerates new program C, and it is joined new the rendition list greater than the concluding time of program B, carry out step 11), otherwise carry out step 15); 15) program journal file misregistration is described, forwards to manually and process, and finish.
Described step 2) specifically may further comprise the steps: 21) read the advertising record row of ad log file, and determine whether end-of-file, then finish if the judgment is Yes, otherwise carry out step 22); 22) the advertising record row is regenerated advertisement A with new form, then judge that the time started of advertisement A whether more than or equal to the concluding time of the upper one advertisement B that regenerates, if the judgment is Yes, then adds new advertising listing with advertisement A, carry out step 21), otherwise carry out step 23); 23) ad log file record mistake is described, forwards to manually and process, and finish.
Described step 3) specifically may further comprise the steps: 31) set up new timeline object set, judge whether all ad datas in all program datas in new the rendition list and the new advertising listing to be processed, then carry out step 32 if the judgment is Yes), otherwise carry out step 34); 32) detect in the new timeline object set whether have new channel, then preserve if the judgment is Yes new channel to database, carry out step 33), otherwise directly carry out step 33); 33) judge in the new timeline object set whether have new program, then preserve if the judgment is Yes new timeline object set to database, finish; 34) judge that whether new the rendition list and new advertising listing all are not empty, if the judgment is Yes, then carry out steps 35), otherwise carry out step 38); 35) zero-time of judging the program data in new the rendition list if the judgment is Yes, then carry out step 36 whether less than the zero-time of the ad data in the new advertising listing), otherwise carry out step 37); 36) enter sub-process, select in chronological order the last item record of program data in new the rendition list and time shaft relatively, and add new timeline object set according to rule, carry out step 31 after ordering is finished); 37) enter sub-process, select in chronological order the last item record of ad data in the new advertising listing and time shaft relatively, and add new timeline object set according to rule, carry out step 31 after ordering is finished); 38) if new the rendition list is not empty, then carry out step 36); 39) if new advertising listing is not empty, then carry out step 37).
Described step 36) or step 37) in sub-process include following steps: 501) create new timeline record R according to new the rendition list or new advertising listing; 502) judge whether new timeline object set is empty, if the judgment is Yes, then add new timeline record R in new timeline object set, sub-process finishes, otherwise carry out step 503); 503) judge that whether the program category of the last item record is identical with new timeline record R, if the judgment is Yes, then adds new timeline record R, otherwise carry out step 504 in new timeline object set); 504) judge that whether the zero-time of the last item record L is identical with the zero-time of new timeline record R, if the judgment is Yes, then carry out step 505), otherwise carry out step 501); 505) judge that whether concluding time of the last item record L is identical with the concluding time of new timeline record R, if the judgment is Yes, then carry out step 506), otherwise carry out step 507); 506) judge whether the last item record L is preferential, and if the judgment is Yes, then sub-process finishes, otherwise deletion the last item records L from new timeline object set, and append new timeline record R in new timeline object set, sub-process finishes; 507) concluding time of judging the last item record L if the judgment is Yes, then carry out step 508 whether less than the concluding time of new timeline record R), otherwise carry out step 509); 508) record the concluding time point of L as node take the last item, new timeline record R is split as leading portion and back segment, then judge whether the last item record L is preferential, if the judgment is Yes, then order is appended the back segment that new timeline records R in the new timeline object set, and sub-process finishes, otherwise deletion the last item records L from new timeline object set, and in new timeline object set, append new timeline record R, sub-process finishes; 509) take the concluding time point of new timeline record R as node, the last item is recorded L be split as leading portion and back segment, judge then whether the last item record L is preferential, if be yes, then sub-process end, otherwise carry out step 510); 510) deletion the last item record L from new timeline object set, and order is appended the back segment that new timeline records R and the last item record L in new timeline object set, sub-process finishes; 511) judge that whether the zero-time of the last item record L is identical less than the zero-time of new timeline record R, if the judgment is Yes, then carry out step 512), otherwise carry out step 525); 512) concluding time of judging the last item record L if the judgment is Yes, then carry out step 513 whether less than the concluding time of new timeline record R), otherwise carry out step 514); 513) in the end generate new record " technological debugging " between the zero-time of the concluding time of a record L and new timeline record R, and append new record " technological debugging " in new timeline object set, sub-process finishes; 514) judge whether the last item record L is program and not preferential, then carry out step 515 if the judgment is Yes), otherwise carry out step 521); 515) whether the concluding time of judging the last item record L if the judgment is Yes then carry out step 516 greater than the zero-time of new timeline record R and simultaneously less than the concluding time of new timeline record R), otherwise carry out step 517); 516) record the zero-time of R as node take new timeline, the last item is recorded L be split as leading portion and back segment, then record the concluding time of L as node take the last item, new timeline record R be will split and leading portion and back segment will be split as, deletion the last item record L from new timeline object set, and order is appended the leading portion of the leading portion of the last item record L, new timeline record R, the back segment of new timeline record R in new timeline object set, and sub-process finishes; 517) concluding time of judging the last item record L if the judgment is Yes, then carry out step 518 whether greater than the concluding time of new timeline record R), otherwise carry out step 519); 518) take the zero-time of new timeline record R and concluding time as node, the last item record L be will split and leading portion, stage casing, back segment will be split as, deletion the last item record L from new timeline object set, and order is appended the leading portion of the last item record L, newly timeline record R, the last item record the back segment of L, and sub-process finishes; 519) judge whether the concluding time of the last item record L equal the concluding time of new timeline record R, if the judgment is Yes, then carry out step 520), otherwise in new timeline object set, append new timeline record R, sub-process finishes; 520) record the zero-time of R as node take new timeline, the last item record L be will split and leading portion and back segment will be split as, then deletion the last item record L from new timeline object set, and order appends leading portion and the new timeline record R of the last item record L, and sub-process finishes; 521) if the last item record L is not that new record " technological debugging " and the last item record L are not advertisements, then carry out step 522), otherwise directly in new timeline object set, append new timeline record R; If the last item record L is not that new record " technological debugging " and the last item record L are preferential, then carry out step 522), otherwise directly in new timeline object set, append new timeline record R; Whether the concluding time of 522) judging the last item record L is greater than the concluding time less than new timeline record R concluding time of the zero-time of new timeline record R and the last item record L, if the judgment is Yes, then carry out step 523), otherwise carry out step 524); 523) record the zero-time of R as node take new timeline, the last item is recorded L split leading portion and back segment, record the concluding time of L as node take the last item, new timeline record R is split as leading portion and back segment, then deletion the last item records L from new timeline object set, and order appends the leading portion of the last item record L, the back segment of the last item record L and the back segment of new timeline record R, and sub-process finishes; 524) concluding time of judging the last item record L, whether if the judgment is Yes, then sub-process finished, otherwise directly appends new timeline record R in new timeline object set more than or equal to the concluding time of new timeline record R; 525) concluding time of judging the last item record L if the judgment is Yes, then carry out step 526 whether greater than the concluding time of new timeline record R), otherwise carry out step 527); 526) record the concluding time of R as node take new timeline, the last item is recorded L split leading portion and back segment, then deletion the last item record L from new timeline object set, and order appends the back segment of new timeline record R and the last item record L, and sub-process finishes; 527) concluding time of judging the last item record L if the judgment is Yes, then carry out step 528 whether less than the concluding time of new timeline record R), otherwise carry out step 529); 528) record the concluding time of L as node take the last item, new timeline record R is split as leading portion and back segment, then deletion the last item record L from new timeline object set, and order appends the leading portion of new timeline record R and the back segment of new timeline record R; 529) then deletion the last item record L from new timeline object set appends new timeline record R, and sub-process finishes.
Compared with prior art, the present invention automatically scans and processes program and channel, fast and accurately independently play daily record with two and merge into a timeline complete, precise restoration broadcast situation, the time that merges 15 days broadcast daily record of 1 channel foreshortened to 30 seconds (not calculating the write into Databasce time) by original 5 minutes, the Primary Stage Data handling implements such as program arrangement are also finished automatically, and the time is by foreshortening to clock more than 5 minutes in original several days.Add the database write angle of incidence, 15 days broadcast daily record of 62 channels can be finished in 15 hours, had greatly increased the ageing of research, and data centralization is kept in the database convenient further the analysis and research.
The present invention is by the research and analysis to two parts data, practical ways according to television program transmission and advertisement insertion, designed by the data method take timeline as crucial clue, in the mode of computer program, general programs broadcast daily record data and advertisement broadcast daily record two parts journal file of apportion have been realized uniting two into one first.Database log file after merging, the detailed situation information of common record and broadcast program and advertisement insertion is integrated in the continuous same records series of timeline, accurately and objectively reduced the actual broadcast situation of TV station, can intactly reproduce all actual contents that the televiewer watches after turning on TV, for further analyze and the communication effect of research TV media and communication process in the various situations that occur, more favorably basic data of portion is provided, and opened research angle and the possibility that apportion document originally can't provide to professional researcher, can understand intuitively to have intercutted what kind of advertisement between what program, the position of each bar advertisement insertion is again how to be distributed in the whole television broadcasting process.This has played new promotion and help to inspiring relevant practitioner and researcher.
Description of drawings
Fig. 1 is the flow chart of the inventive method;
Fig. 2 is the sub-process figure of the inventive method;
Fig. 3 is the system configuration schematic diagram of the inventive method.
PL among Fig. 1: program set, AL: advertising aggregator, TL: timeline set, SoT: transmission opening flag, EoT: end of transmission sign, SDT: program time Start Date, EDT: time program Close Date;
PL among Fig. 2: program set, AL: advertising aggregator, TL: timeline set, SoT: transmission opening flag, EoT: end of transmission sign, SDT: program time Start Date, EDT: time program Close Date.
Embodiment
The present invention is described in detail below in conjunction with the drawings and specific embodiments.
Embodiment
As shown in Figure 1, present embodiment may further comprise the steps:
1) data processing server loads the program log file in the program log document storage server, generates new the rendition list PL.The program log file is the broadcast daily record in a certain channel a period of time.Form is the Excel file, and worksheet names is " program ", and the order of row is { " programm name ", " channel ", " date ", " time started ", " concluding time ", " audience ratings ", " market share " }, the first behavior row title.Record is arranged according to date and time started ascending order.Generate simultaneously the rendition list PL.PL is an object set of preserving program, and the element P in the set represents a broadcast items, and attribute { Label, Channel, Date, SDT, EDT, the column data in the corresponding journal file of IsPriority} difference are arranged.Do not have object elements among the PL this moment.Carry out step 2).
2) it is capable to read program recording: read the delegation in the program log.Carry out step 3).
3) judge whether end-of-file, then carry out step 13 if the judgment is Yes), otherwise carry out step 4).
4) generate program: according to the program log row that reads, generate new program P.Carry out step 5).
Is 5) title SoT or EoT?: determine whether to begin the sign that broadcasts and finish to broadcast, if the judgment is Yes, then carry out step 6), otherwise carry out step 8).
6) program priority is made as True: program priority IsPriority is made as 1, (being defaulted as 0).Carry out step 7).
7) program is added the rendition list PL, carry out step 2).
8) EDT of the upper record of judgement SDT=?: judge namely whether the time started P.SDT of current program P equals the concluding time P ' .EDT of a upper program P ' among the PL.Here whether continuous at the detection program.Carry out step 7 if the judgment is Yes), otherwise carry out step 9).
9) do you judge SDT＞upper one EDT that records?: whether the time started P.SDT that namely judges current program P is greater than the concluding time P ' .EDT of a upper program P ' among the PL.If condition is set up, illustrate between the program discontinuously, need the new program of generation to fill.Then carry out step 10 if the judgment is Yes), otherwise carry out step 9).
10) generate new program: EDT=SDT} carry out step 11 for Label=" without program ", the EDT of the upper record of SDT=).
11) with step 10) the middle new program NP adding the rendition list PL that generates, carry out step 7).
12) original record is illegal, forwards artificial treatment to, step 8) and step 9) condition be false, the time started that this record is described, the log existing problems need to be carried out artificial treatment early than the concluding time of a upper record.Flow process finishes.
13) the ad log file in the data processing server carrying advertisement journal file storage server generates new advertising listing AL: the ad log file is the broadcast daily record in a certain channel a period of time.Form is the Excel file, and worksheet names is " advertisement ", and the order of row is { " advertised name ", " date ", " channel ", " time started ", " duration ", " audience ratings ", " price " }, the first behavior row title.Record is arranged according to date and time started ascending order.Simultaneously generating advertisement tabulation AL.AL is an object set of preserving advertisement, and the elements A in the set represents one and broadcasts advertisement, and attribute { Label, Channel, Date, SDT, the column data in the corresponding journal file of EDT} difference are arranged.Do not have object elements among the AL this moment.Wherein EDT will calculate according to SDT and duration.Carry out step 14).
14) read the advertising record row: read the delegation in the ad log, carry out step 15).
15) judge whether end-of-file, for being then carry out step 20), otherwise carry out step 16).
16) generating advertisement: according to the ad log row that reads, generate new advertisement A.Carry out step 17).
17) EDT of judgement SDT＞=upper record?: namely whether the time started A.SDT of current program A is more than or equal to the concluding time A ' .EDT of a upper program A ' among the AL.Here in the legitimacy that detects the daily record sequencing.Then carry out step 18 if the judgment is Yes), otherwise carry out step 19).
18) advertisement is added advertising listing AL, carry out step 14).
19) original record is illegal, forwards artificial treatment to: step 17) condition is false, and is described early than the concluding time of a upper record time started of this record, and the log existing problems need to be carried out artificial treatment.Flow process finishes.
20) newly-built timeline TL:TL is the object set of a holding time line record, and what preserve in the timeline can be program, can be advertisement, can be debug signal also, have attribute { ProgramName, Channel, Date, SDT, EDT} carry out step 21).
21) initialization pi, ai: initialization pi, ai.Pi and ai are the call numbers for object elements in index PL and the AL set.Carry out step 22).
22) do you judge pi+ai＜PL.Count+AL.Count?: namely judge whether objects all in PL and the AL is processed, for being then carry out step 31), otherwise carry out step 23).
23) judge PL[pi] be not empty, and AL[ai] not for empty: judge whether to exist PL[pi] or AL[ai] object.If both exist, then need to judge the priority of its time started SDT.For being then carry out step 24), otherwise carry out step 29).
24) judge PL[pi] .SDT＜AL[ai] .SDT?: whether the zero-time of judging program is more Zao than the zero-time of advertisement, for being then carry out step 25), otherwise carry out step 27).
25) enter sub-process S-with PL[pi] with the last item of time shaft record relatively, and add TL according to rule, carry out step 26).
26) pi++: the call number of cumulative PL, carry out step 22).
27) enter sub-process S-with AL[ai] with the last item of time shaft record relatively, and add TL according to rule, carry out step 28).
28) ai++: the call number of cumulative AL, carry out step 22).
29) judge PL[pi] be not?: when step 23) being false, PL[pi] or AL[ai] in have at least one not exist.Illustrate that if there is no PL finishes dealing with.Here detect PL[pi] whether exist.If there is PL[pi], just it is processed.For being then carry out step 25), otherwise carry out step 30).
30) judge AL[ai] be not empty?: step 23) and step 29) when being false, AL[ai] may not exist, if there is no, illustrate that AL finishes dealing with.Here detect AL[ai] whether exist.If exist, just it processed.For being then carry out step 27), otherwise carry out step 22).
31) detect among the TL whether have new channel, for being then carry out step 33), otherwise carry out step 32).
32) preserve new channel to database, carry out step 33).
33) detect among the TL whether have new program, for being then carry out step 35), otherwise carry out step 34).
34) determine the program macrotaxonomy according to program category (program/advertisement/skill is transferred), and preserve new program, carry out step 35).
35) line is to database server the holding time, and flow process finishes.
Sub-process may further comprise the steps:
S1) according to PL[pi] or AL[ai] create new timeline record R, carry out step S2).
S2) judge whether TL does not have record, for being then carries out step S3), otherwise carry out step S4).
S3) in TL, append R, namely directly add new timeline record R.Sub-process finishes.
S4) the last item with TL records assignment to L.After this will carry out rule process to L and R.Carry out step S5).
S5) is the program category of L identical with R?: whether the program category of L is identical with R.If type is identical, can directly add R, because in PL and AL, combing was sequentially done in broadcast.For being carries out step S3), otherwise carry out step S6).
S6) L.SDT=R.SDT?: judge whether zero-time is identical, for being carries out step S7), otherwise carry out step S18).
S7) L.EDT=R.EDT?: judge whether the concluding time is identical, for being carries out step S8), otherwise carry out step S10).
S8) do you judge whether L preferential? for being that then sub-process finishes, otherwise carry out step S9).
S9) delete L from TL, and append R in TL, sub-process finishes.
S10) do you judge L.EDT＜R.EDT? for being carries out step S11), otherwise carry out step S15).
S11) splitting R in the L.EDT moment point is R1, and R2 carries out step S12).
S12) do you judge whether L preferential? for being carries out step S13), otherwise carry out step S14).
S13) it is preferential sequentially to append R2:L in TL, keeps L, appends R2 again, and sub-process finishes.
S14) delete L from TL, and sequentially append R1, R2:L is not preferential, and deletion L appends R1, R2, and sub-process finishes.
S15) splitting L in the R.EDT moment point is L1, and L2 carries out S16).
S16) do you judge whether L preferential? for being carries out step S13), otherwise carry out step S14).
S17) L is not preferential, deletes L from TL, and order is appended R, L2, sub-process end.
S18) do you judge L.SDT＜R.SDT?: the time started of L is early than the time started of R, for being carries out step S19), otherwise carry out step S32).
S19) do you judge L.EDT＜R.SDT? for being carries out step S20), otherwise carry out step S21).
S20) generate new record according to L.EDT and two time points of R.SDT " technological debugging ", and in TL, append new record, sub-process finishes.
S21) do you judge that L is program and not preferential? for being carries out step S22), otherwise carry out step S28).
S22) do you judge L.EDT＞R.SDT and L.EDT＜R.EDT? for being carries out step S23), otherwise carry out step S24).
S23) splitting L in the R.SDT moment point is L1, L2; Splitting R at L.EDT is R1, and R2. deletes L from TL, and order is appended L1, R1, R2, sub-process end.
S24) do you judge L.EDT＞R.EDT? for being carries out step S25), otherwise carry out step S26).
S25) in R.SDT and two moment point of R.EDT, fractionation L is L1, and L2, L3. delete L from TL, and order is appended L1, R, L3, sub-process end.
S26) do you judge L.EDT=R.EDT? for being carries out step S27), otherwise carry out step S3).
S27) splitting L in the R.SDT moment point is L1, and L2. deletes L from TL, and order is appended L1, R, sub-process end.
S28) do you judge that L is that advertisement or preferential and L are not that skill is transferred? for being carries out step S29), otherwise carry out step S3).
S29) do you judge L.EDT＞R.SDT and L.EDT＜R.EDT? for being carries out step S30), otherwise carry out step S31).
S30) splitting L in the R.SDT moment point is L1, L2; Splitting R at L.EDT is R1, and R2. deletes L from TL, and order is appended L1, L2, R2, sub-process end.
S31) do you judge L.EDT＞=R.EDT? for being that then sub-process finishes, otherwise carry out step S3.
S32) do you judge L.EDT＞R.EDT? for being carries out step S33), otherwise carry out step S34).
S33) splitting L in the R.EDT moment point is L1, and L2. deletes L in TL, and order is appended R, L2, sub-process end.
S34) do you judge L.EDT＜R.EDT? for being carries out step S35), otherwise carry out step S36).
S35) splitting R in the L.EDT moment point is R1, and R2. deletes L in TL and order is appended R1, R2, and sub-process finishes.
S36) delete L in TL, append R., sub-process finishes.
Fig. 1 is illustrated, for example:
Suppose that input program log file content is:
Input ad log file content is
Operational process step of the present invention is as follows:
The first step, loading program log file.Generate new the rendition list PL, namely load program log file (give tacit consent to the first behavior field name row, offical record is since the second row), carry out second step;
Second step, to read program recording capable, reads the delegation in the program log
The 3rd the step, judge whether end-of-file, the result is judged as no, carries out for the 4th step;
The 4th step, generation program: according to the program log row that reads, generate new program P
P.Label＝”Start?of?Transmission”
P.Channel=" BTV "
P.Date＝”2010-11-15”
P.SDT＝”2010-11-15?02:00:00”
P.EDT＝”2010-11-15?02:00:01”
P.IsPriority=0 carried out for the 5th step;
Are the 5th step, judgement names SoT or EoT? the result is judged as and is, carries out for the 6th step;
The 6th the step, program priority is made as True, namely P.IsPriority=1 carried out for the 7th step;
The 7th step, program is added the rendition list PL, be about to program P and add the rendition list PL
PL={Label=" Start of Transmission ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" 2010-11-15 02:00:00 ", EDT=" 2010-11-15 02:00:01 ", IsPriority=1} carries out second step; After all programs are drained, obtain following the rendition list PL:
PL={Label=" Start of Transmission ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:00:00 ", EDT=" and 2010-11-15 02:00:01 ", IsPriority=1},
Label=" and second 13 rod monk of Shaolin Temple legend ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:00:00 ", EDT=" and 2010-11-15 02:16:59 ", IsPriority=0},
Label=" and the rubber fruit world ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:16:59 ", EDT=" and 2010-11-15 02:27:01 ", IsPriority=0},
Label=" and TV guide ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:27:01 ", EDT=" and 2010-11-15 02:29:56 ", IsPriority=0},
Label=" and the 4th one of iron teeth copper tooth discipline morning mist ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:29:56 ", EDT=" and 2010-11-15 03:15:00 ", IsPriority=0},
Label=" and TV guide ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 03:15:00 ", EDT=" and 2010-11-15 03:19:00 ", IsPriority=0}
The 8th step, carrying advertisement journal file, the new advertising listing AL of generation namely load journal file (give tacit consent to the first behavior field name row, offical record is since the second row): carried out for the 9th step;
The 9th the step, read the advertising record row, namely read the delegation in the ad log
The tenth the step, judge whether end-of-file, the result is judged as no, carries out for the 11 step;
The 11 step, generating advertisement: namely according to the ad log row that reads, generate new advertisement A.
A={Label=" TV guide ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:26:57 ", EDT=" and 2010-11-15 02:29:52 ", carried out for the 12 step;
The EDT of the 12 step, judgement SDT＞=upper record, the result is judged as and is, carries out for the 13 step;
The 13 the step, advertisement is added advertising listing AL, obtain following the rendition list AL after all advertising listings are drained:
AL={Label=" TV guide ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:26:57 ", EDT=" and 2010-11-15 02:29:52 ",
Label=" and this media and communications ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:29:52 ", EDT=" and 2010-11-15},
Label=" and TV guide ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 03:14:59 ", EDT=" and 2010-11-15 03:19:59},
Label=" and public and social interest ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 03:19:59 ", EDT=" and 2010-11-15 03:20:59},
... carried out for the 14 step;
The 14 step, newly-built timeline TL: namely TL is the object set of a holding time line record, and what preserve in the timeline can be program, can be advertisement, also can be debug signal, have attribute { ProgramName, Channel, Date, SDT, EDT} carried out for the 15 step;
The 15 step, initialization pi, ai: i.e. pi=0, ai=0.Pi and ai are the call numbers for object elements in index PL and the AL set.Carried out for the 16 step;
The 16 step, judgement pi+ai＜PL.Count+AL.Count? the result is judged as no, carries out for the 17 step;
The 17 step, judgement PL[pi] be not empty, and AL[ai] be not empty, the result is judged as and is, carries out for the 18 step;
The 18 step, judgement PL[pi] .SDT＜AL[ai] .SDT, the result is judged as and is, carries out for the 19 step;
The 19 step, enter sub-process S-with PL[pi] with the last item of time shaft record relatively, and add TL according to rule, carried out for the 20 step;
The 20 step, pi++, namely the call number of cumulative PL carried out for the 21 step;
Do not have new channel among the 21 step, the judgement TL, the result is judged as no, carries out for the 22 step;
The 22 step, preservation new channel are namely preserved " BTV " to database, carry out for the 23 step;
Is not there new program among the 23 step, the judgement TL? the result is judged as no, carries out for the 24 step;
The 24 step, according to program category (program/advertisement/skill transfer) determine the program macrotaxonomy, and preserve new program, carried out for the 25 step;
The 25 step, holding time line are to database.
As follows to illustrating of Fig. 2:
Suppose existing
PL={Label=" Start of Transmission ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:00:00 ", EDT=" and 2010-11-15 02:00:01 ", IsPriority=1},
Label=" and second 13 rod monk of Shaolin Temple legend ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:00:00 ", EDT=" and 2010-11-15 02:16:59 ", IsPriority=0},
Label=" and the rubber fruit world ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:16:59 ", EDT=" and 2010-11-15 02:27:01 ", IsPriority=0},
Label=" and TV guide ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:27:01 ", EDT=" and 2010-11-15 02:29:56 ", IsPriority=0},
Label=" and the 4th one of iron teeth copper tooth discipline morning mist ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:29:56 ", EDT=" and 2010-11-15 03:15:00 ", IsPriority=0},
Label=" and TV guide ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 03:15:00 ", EDT=" and 2010-11-15 03:19:00 ", IsPriority=0}
AL={Label=" TV guide ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:26:57 ", EDT=" and 2010-11-15 02:29:52 ",
Label=" and this media and communications ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:29:52 ", EDT=" and 2010-11-15 02:29:57 ",
Label=" and TV guide ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 03:14:59 ", EDT=" and 2010-11-15 03:19:59 ",
Label=" and public and social interest ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 03:19:59 ", EDT=" and 2010-11-15 03:20:59 ",
TL={Label=" Start of Transmission ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:00:00 ", EDT=" and 2010-11-15 02:00:01 ", IsPriority=1},
Label=" and second 13 rod monk of Shaolin Temple legend ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:00:00 ", EDT=" and 2010-11-15 02:16:59 ", IsPriority=0},
Label=" and the rubber fruit world ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:16:59 ", EDT=" and 2010-11-15 02:27:01 ", IsPriority=0}
Execution in step is as follows:
A, according to PL[pi] or AL[ai] create new timeline record R: i.e. R=AL[0]=Label=" TV guide ", Channel=" BTV ", Date=" 2010-11-15 ", SDT=" and 2010-11-15 02:26:57 ", EDT=" and 2010-11-15 02:29:52 ";
Are B, judgement TL empty? the result is judged as no, carries out step C;
C, with the last item of TL record assignment to L: i.e. L={Label=" the rubber fruit is international ", Channel=" BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:16:59 ", EDT=" 2010-11-15 02:27:01 ", IsPriority=0};
Do you D, judge that the program category of L is identical with R? the result is judged as no, carries out step e;
E, judgement L.SDT=R.SDT? the result is judged as no, carries out step F;
F, judgement L.SDT＜R.SDT? the result is judged as and is, carries out step G;
G, judgement L.EDT＜R.SDT? the result is judged as no, carries out step H;
Are H, judgement L programs and not preferential? the result is judged as and is, carries out step I;
I, judgement L.EDT＞R.SDT and L.EDT＜R.EDT? the result is judged as and is, carries out step J;
J, to split L in the R.SDT moment point be L1, L2; Splitting R at L.EDT is R1, and R2. deletes L from TL, and sequentially appends L1, R1, and R2,
Be L1={Label=" the rubber fruit world ", Channel=" and BTV ", Date " and 2010-11-15 ", SDT=" and 2010-11-15 02:16:59 ", EDT=" and 2010-11-15 02:26:57 ", IsPriority=0}
L2={Label=" the rubber fruit world ", Channel=" and BTV ", Date " and 2010-11-15 ", SDT=" and 2010-11-15 02:26:57 ", EDT=" and 2010-11-15 02:27:01 ", IsPriority=0}
R1={Label=" TV guide ", Channel=" and BTV ", Date " and 2010-11-15 ", SDT=" and 2010-11-15 02:26:57 ", EDT=" and 2010-11-15 02:27:01 "
R2={Label=" TV guide ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:27:01 ", EDT=" and 2010-11-15 02:29:52 "
TL appends L1, R1, R2, end of subroutine.
The timeline result was as shown in table 1 after flow process was all finished, (only listing critical field)
Table 1. flow performing result
| Sequence number | Programm name | Date | Channel | Time started | Concluding |
| 1 | Start?of? |
11/15/2010 | BTV | 2:00:00AM | 2:00: |
| 2 | |
11/15/2010 | BTV | 2:00:00AM | 2:16: |
| 3 | The rubber fruit is international | 11/15/2010 | BTV | 2:16:59AM | 2:26: |
| 4 | |
11/15/2010 | BTV | 2:26:57AM | 2:27: |
| 5 | |
11/15/2010 | BTV | 2:27:01AM | 2:29:52AM |
| 6 | This media and |
11/15/2010 | BTV | 2:29:52AM | 2:29: |
| 7 | The 4th one of iron teeth copper tooth |
11/15/2010 | BTV | 2:29:56AM | 3:14:59AM |
| 8 | |
11/15/2010 | BTV | 3:14:59AM | 3:15: |
| 9 | |
11/15/2010 | BTV | 3:15:00AM | 3:19: |
| 10 | |
11/15/2010 | BTV | 3:19:00AM | 3:19: |
| 11 | Public and |
11/15/2010 | BTV | 3:19:59AM | 3:20: |
| 12 | |
11/15/2010 | BTV | 3:20:59AM | 3:21:00AM |
As shown in Figure 3, the related hardware system of said method operation comprises program log document storage server 1, ad log document storage server 2, data processing server 3, database server 4, and wherein program log document storage server 1, ad log document storage server 2, data processing server 3 and database server 4 connect by local area network (LAN).
Claims (5)
1. processing method that is used for the broadcast content timeline data of TV programme assessment is characterized in that this processing method may further comprise the steps:
1) data processing server loads the program log file in the program log document storage server, generates new program data, carry out step 2 after loading is finished);
2) the ad log file in the data processing server carrying advertisement journal file storage server generates new advertising listing data, carry out step 3 after loading is finished);
3) set up new timeline object set, ad data in program data in new the rendition list and the new advertising listing is merged in the timeline object set according to time order and function and priority, and then line object is gathered database server the holding time.
2. the processing method of a kind of broadcast content timeline data for TV programme assessment according to claim 1 is characterized in that described step 1) specifically may further comprise the steps:
11) program recording that reads in the program log file is capable, and determines whether end-of-file, then finishes if the judgment is Yes, otherwise carry out step 12);
12) regenerate program A with new form with program recording is capable, whether the title of then judging program A is " program begins " or " program end ", if the judgment is Yes, then carry out step 13), otherwise whether the time started of judging program A equals the concluding time of a program B who regenerates, if the judgment is Yes, then program A is added new the rendition list, otherwise carry out step 14);
13) priority with program A is made as very, if the name of program A is called " program begins " then program A is added new the rendition list, then carry out step 11), if the name of program A is called " program end ", then program A is added new the rendition list, finish;
Whether the time started of 14) judging program A if the judgment is Yes, then regenerates new program C, and it is joined new the rendition list greater than the concluding time of program B, carry out step 11), otherwise carry out step 15);
15) program journal file misregistration is described, forwards to manually and process, and finish.
3. the processing method of a kind of broadcast content timeline data for TV programme assessment according to claim 1 is characterized in that described step 2) specifically may further comprise the steps:
21) read the advertising record row of ad log file, and determine whether end-of-file, then finish if the judgment is Yes, otherwise carry out step 22);
22) the advertising record row is regenerated advertisement A with new form, then judge that the time started of advertisement A whether more than or equal to the concluding time of the upper one advertisement B that regenerates, if the judgment is Yes, then adds new advertising listing with advertisement A, carry out step 21), otherwise carry out step 23);
23) ad log file record mistake is described, forwards to manually and process, and finish.
4. the processing method of a kind of broadcast content timeline data for TV programme assessment according to claim 1 is characterized in that described step 3) specifically may further comprise the steps:
31) set up new timeline object set, judge whether all ad datas in all program datas in new the rendition list and the new advertising listing to be processed, then carry out step 32 if the judgment is Yes), otherwise carry out step 34);
32) detect in the new timeline object set whether have new channel, then preserve if the judgment is Yes new channel to database, carry out step 33), otherwise directly carry out step 33);
33) judge in the new timeline object set whether have new program, then preserve if the judgment is Yes new timeline object set to database, finish;
34) judge that whether new the rendition list and new advertising listing all are not empty, if the judgment is Yes, then carry out steps 35), otherwise carry out step 38);
35) zero-time of judging the program data in new the rendition list if the judgment is Yes, then carry out step 36 whether less than the zero-time of the ad data in the new advertising listing), otherwise carry out step 37);
36) enter sub-process, select in chronological order the last item record of program data in new the rendition list and time shaft relatively, and add new timeline object set according to rule, carry out step 31 after ordering is finished);
37) enter sub-process, select in chronological order the last item record of ad data in the new advertising listing and time shaft relatively, and add new timeline object set according to rule, carry out step 31 after ordering is finished);
38) if new the rendition list is not empty, then carry out step 36);
39) if new advertising listing is not empty, then carry out step 37).
5. the processing method of a kind of broadcast content timeline data for TV programme assessment according to claim 4 is characterized in that described step 36) or step 37) in sub-process include following steps:
501) create new timeline record R according to new the rendition list or new advertising listing;
502) judge whether new timeline object set is empty, if the judgment is Yes, then add new timeline record R in new timeline object set, sub-process finishes, otherwise carry out step 503);
503) judge that whether the program category of the last item record is identical with new timeline record R, if the judgment is Yes, then adds new timeline record R, otherwise carry out step 504 in new timeline object set);
504) judge that whether the zero-time of the last item record L is identical with the zero-time of new timeline record R, if the judgment is Yes, then carry out step 505), otherwise carry out step 501);
505) judge that whether concluding time of the last item record L is identical with the concluding time of new timeline record R, if the judgment is Yes, then carry out step 506), otherwise carry out step 507);
506) judge whether the last item record L is preferential, and if the judgment is Yes, then sub-process finishes, otherwise deletion the last item records L from new timeline object set, and append new timeline record R in new timeline object set, sub-process finishes;
507) concluding time of judging the last item record L if the judgment is Yes, then carry out step 508 whether less than the concluding time of new timeline record R), otherwise carry out step 509);
508) record the concluding time point of L as node take the last item, new timeline record R is split as leading portion and back segment, then judge whether the last item record L is preferential, if the judgment is Yes, then order is appended the back segment that new timeline records R in the new timeline object set, and sub-process finishes, otherwise deletion the last item records L from new timeline object set, and in new timeline object set, append new timeline record R, sub-process finishes;
509) take the concluding time point of new timeline record R as node, the last item is recorded L be split as leading portion and back segment, judge then whether the last item record L is preferential, if be yes, then sub-process end, otherwise carry out step 510);
510) deletion the last item record L from new timeline object set, and order is appended the back segment that new timeline records R and the last item record L in new timeline object set, sub-process finishes;
511) judge that whether the zero-time of the last item record L is identical less than the zero-time of new timeline record R, if the judgment is Yes, then carry out step 512), otherwise carry out step 525);
512) concluding time of judging the last item record L if the judgment is Yes, then carry out step 513 whether less than the concluding time of new timeline record R), otherwise carry out step 514);
513) in the end generate new record " technological debugging " between the zero-time of the concluding time of a record L and new timeline record R, and append new record " technological debugging " in new timeline object set, sub-process finishes;
514) judge whether the last item record L is program and not preferential, then carry out step 515 if the judgment is Yes), otherwise carry out step 521);
515) whether the concluding time of judging the last item record L if the judgment is Yes then carry out step 516 greater than the zero-time of new timeline record R and simultaneously less than the concluding time of new timeline record R), otherwise carry out step 517);
516) record the zero-time of R as node take new timeline, the last item is recorded L be split as leading portion and back segment, then record the concluding time of L as node take the last item, new timeline record R be will split and leading portion and back segment will be split as, deletion the last item record L from new timeline object set, and order is appended the leading portion of the leading portion of the last item record L, new timeline record R, the back segment of new timeline record R in new timeline object set, and sub-process finishes;
517) concluding time of judging the last item record L if the judgment is Yes, then carry out step 518 whether greater than the concluding time of new timeline record R), otherwise carry out step 519);
518) take the zero-time of new timeline record R and concluding time as node, the last item record L be will split and leading portion, stage casing, back segment will be split as, deletion the last item record L from new timeline object set, and order is appended the leading portion of the last item record L, newly timeline record R, the last item record the back segment of L, and sub-process finishes;
519) judge whether the concluding time of the last item record L equal the concluding time of new timeline record R, if the judgment is Yes, then carry out step 520), otherwise in new timeline object set, append new timeline record R, sub-process finishes;
520) record the zero-time of R as node take new timeline, the last item record L be will split and leading portion and back segment will be split as, then deletion the last item record L from new timeline object set, and order appends leading portion and the new timeline record R of the last item record L, and sub-process finishes;
521) if the last item record L is not that new record " technological debugging " and the last item record L are not advertisements, then carry out step 522), otherwise directly in new timeline object set, append new timeline record R; If the last item record L is not that new record " technological debugging " and the last item record L are preferential, then carry out step 522), otherwise directly in new timeline object set, append new timeline record R;
Whether the concluding time of 522) judging the last item record L is greater than the concluding time less than new timeline record R concluding time of the zero-time of new timeline record R and the last item record L, if the judgment is Yes, then carry out step 523), otherwise carry out step 524);
523) record the zero-time of R as node take new timeline, the last item is recorded L split leading portion and back segment, record the concluding time of L as node take the last item, new timeline record R is split as leading portion and back segment, then deletion the last item records L from new timeline object set, and order appends the leading portion of the last item record L, the back segment of the last item record L and the back segment of new timeline record R, and sub-process finishes;
524) concluding time of judging the last item record L, whether if the judgment is Yes, then sub-process finished, otherwise directly appends new timeline record R in new timeline object set more than or equal to the concluding time of new timeline record R;
525) concluding time of judging the last item record L if the judgment is Yes, then carry out step 526 whether greater than the concluding time of new timeline record R), otherwise carry out step 527);
526) record the concluding time of R as node take new timeline, the last item is recorded L split leading portion and back segment, then deletion the last item record L from new timeline object set, and order appends the back segment of new timeline record R and the last item record L, and sub-process finishes;
527) concluding time of judging the last item record L if the judgment is Yes, then carry out step 528 whether less than the concluding time of new timeline record R), otherwise carry out step 529);
528) record the concluding time of L as node take the last item, new timeline record R is split as leading portion and back segment, then deletion the last item record L from new timeline object set, and order appends the leading portion of new timeline record R and the back segment of new timeline record R;
529) then deletion the last item record L from new timeline object set appends new timeline record R, and sub-process finishes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110253503.6A CN102957948B (en) | 2011-08-30 | 2011-08-30 | A kind of processing method of the broadcast content timeline data for television program assessment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110253503.6A CN102957948B (en) | 2011-08-30 | 2011-08-30 | A kind of processing method of the broadcast content timeline data for television program assessment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102957948A true CN102957948A (en) | 2013-03-06 |
| CN102957948B CN102957948B (en) | 2015-10-07 |
Family
ID=47766092
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110253503.6A Expired - Fee Related CN102957948B (en) | 2011-08-30 | 2011-08-30 | A kind of processing method of the broadcast content timeline data for television program assessment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102957948B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106060589A (en) * | 2016-05-31 | 2016-10-26 | 无锡天脉聚源传媒科技有限公司 | Method and device for analyzing program information |
| CN107888977A (en) * | 2017-11-27 | 2018-04-06 | 山东浪潮商用系统有限公司 | A kind of method and device for detecting electronic program guides |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1968389A (en) * | 2005-11-18 | 2007-05-23 | 株式会社日立制作所 | Recording reproduction device |
| CN101640777A (en) * | 2008-07-31 | 2010-02-03 | 富士通株式会社 | Video reproducing device and video reproducing method |
| US20100095345A1 (en) * | 2008-10-15 | 2010-04-15 | Samsung Electronics Co., Ltd. | System and method for acquiring and distributing keyframe timelines |
| CN101883252A (en) * | 2010-05-31 | 2010-11-10 | 中山大学 | Digital television visual media information feedback system and method thereof |
| CN101978692A (en) * | 2008-04-03 | 2011-02-16 | 爱立信电话股份有限公司 | Interactive media system and method for dimensioning interaction servers in an interactive media system |
-
2011
- 2011-08-30 CN CN201110253503.6A patent/CN102957948B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1968389A (en) * | 2005-11-18 | 2007-05-23 | 株式会社日立制作所 | Recording reproduction device |
| CN101978692A (en) * | 2008-04-03 | 2011-02-16 | 爱立信电话股份有限公司 | Interactive media system and method for dimensioning interaction servers in an interactive media system |
| CN101640777A (en) * | 2008-07-31 | 2010-02-03 | 富士通株式会社 | Video reproducing device and video reproducing method |
| US20100095345A1 (en) * | 2008-10-15 | 2010-04-15 | Samsung Electronics Co., Ltd. | System and method for acquiring and distributing keyframe timelines |
| CN101883252A (en) * | 2010-05-31 | 2010-11-10 | 中山大学 | Digital television visual media information feedback system and method thereof |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106060589A (en) * | 2016-05-31 | 2016-10-26 | 无锡天脉聚源传媒科技有限公司 | Method and device for analyzing program information |
| CN106060589B (en) * | 2016-05-31 | 2019-04-12 | 无锡天脉聚源传媒科技有限公司 | A kind of analysis method and device of programme information |
| CN107888977A (en) * | 2017-11-27 | 2018-04-06 | 山东浪潮商用系统有限公司 | A kind of method and device for detecting electronic program guides |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102957948B (en) | 2015-10-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20080120646A1 (en) | Automatically associating relevant advertising with video content | |
| US20150350732A1 (en) | Assessing digital content across a communications network | |
| US8972374B2 (en) | Content acquisition system and method of implementation | |
| KR102024933B1 (en) | apparatus and method for tracking image content context trend using dynamically generated metadata | |
| CN106921614B (en) | Service data processing method and device | |
| CN103324696B (en) | A kind of data log collection and statistical analysis system and method | |
| GB2462931A (en) | Digital media files republished in a consolidated collection with cleansed metadata | |
| CN110881131B (en) | Classification method of live review videos and related device thereof | |
| CN102957948B (en) | A kind of processing method of the broadcast content timeline data for television program assessment | |
| CN105338379B (en) | Soft broadcast data monitoring and mining system and method thereof | |
| CN103426050B (en) | System is supported in business problem analysis | |
| US20040093262A1 (en) | Method and apparatus for collecting and analyzing the sale and use of pre-recorded entertainment products | |
| CN102007764B (en) | Method of storing and displaying broadcast contents and apparatus therefor | |
| WO2012070182A1 (en) | Estimation apparatus, estimation method, and program | |
| US20080196054A1 (en) | Method and system for facilitating analysis of audience ratings data for content | |
| CN102681883B (en) | Resource calling method and system in media asset searching and browsing system | |
| CN102194504A (en) | Media file play method, player and server for playing medial file | |
| CN102812722A (en) | Information processing program, device, and method | |
| CN113298106A (en) | Sample generation method and device, server and storage medium | |
| CN108337503B (en) | Digital television field environment simulation method, terminal and computer readable medium | |
| CN111831683A (en) | Automatic auditing method and system based on dynamic extended scene matching | |
| JP7570189B2 (en) | Channel Content Creation System | |
| Splendore et al. | Entertainment is serious stuff: the politicisation of everyday laughs | |
| CN102723091B (en) | Rough editing method based on electronic news gathering ENG material uploading | |
| CN108073638A (en) | Data diagnosis method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20151007 Termination date: 20210830 |